satabs: A Bit-Precise Verifier for C Programs - (Competition Contribution)

SatAbs is a bit-precise software model checker for ANSI-C programs. It implements sound predicate-abstraction based algorithms for both sequential and concurrent software. 1 Verification Approach SatAbs [7] is a verifier for C programs that uses counterexample-guided abstraction refinement [8] (Fig. 1), based on predicate abstraction [12], as pioneered by SLAM [2]. By interpreting variables of the C program as bit-vectors, efficient SAT procedures are used for abstraction and simulation [6]. This renders the theorem prover calls that are made during abstraction decidable, and enables bit-precise verification, which is essential when analysing system-level software. In [10] the first sound and symmetry-aware predicate abstraction based approach towards model checking multi-threaded programs was presented. These results have now been integrated with SatAbs, allowing scalable verification of concurrent C programs comprised of replicated threads. 1.) Compute Abstraction 2.) Check Abstraction 3.) Check Feasibility 4.) Refine Predicates C program